Tableaux for Hybrid XPath with Data
نویسندگان
چکیده
We provide a sound, complete and terminating tableau procedure to check satisfiability of downward XPath= formulas enriched with nominals and satisfaction operators. The calculus is inspired by ideas introduced to ensure termination of tableau calculi for certain Hybrid Logics. We prove that even though we increased the expressive power of XPath by introducing hybrid operators, the satisfiability problem for the obtained logic is still PSpace-complete.
منابع مشابه
XPath and Modal Logics of Finite DAG's
XPath, CTL and the modal logics proposed by Blackburn et al, Palm and Kracht are variable free formalisms to describe and reason about (finite) trees. XPath expressions evaluated at the root of a tree correspond to existential positive modal formulas. The models of XPath expressions are finite ordered trees, or in the presence of XML’s ID/IDREF mechanism graphs. The ID/IDREF mechanism can be se...
متن کاملHilbert-Style Axiomatization for Hybrid XPath with Data
In this paper we introduce a sound and complete axiomatization for XPath with data constraints extended with hybrid operators. First, we define HXPath=(↑↓), an extension of vertical XPath with nominals and the hybrid operator @. Then, we introduce an axiomatic system for HXPath=(↑↓), and we prove it is complete with respect to the class of abstract data trees, i.e., data trees in which data val...
متن کاملLow-latency XPath Query Evaluation on Multi-Core Processors
XML and the XPath querying language have become ubiquitous data and querying standards used in many industrial settings and across the World-Wide Web. The high latency of XPath queries over large XML databases remains a problem for many applications. While this latency could be reduced by parallel execution, issues such as work partitioning, memory contention, and load imbalance may diminish th...
متن کاملInterpreting XPath by Iterative Pattern Matching with Paisley
The Paisley architecture is a light-weight EDSL for non-deterministic pattern matching. It automates the querying of arbitrary objectoriented data models in a general-purpose programming language, using API, libraries and simple programming patterns in a portable and noninvasive way. The core of Paisley has been applied to real-world applications. Here we discuss the extension of Paisley by pat...
متن کاملSatisfiability of Constraint Specifications on XML Documents
Jose Meseguer is one of the earliest contributors in the area of Algebraic Specification. In this paper, which we are happy to dedicate to him on the occasion of his 65th birthday, we use ideas and methods coming from that area with the aim of presenting an approach for the specification of the structure of classes of XML documents and for reasoning about them. More precisely, we specify the st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017